The anti-Kekulé number of graphs
نویسندگان
چکیده
Perfect matchings in chemical graphs correspond to Kekulé structures underlying structure, which play an important role the analysis of resonance energy and stability certain compounds. In 2007, Vukičević Trinajstić introduced concept anti-Kekulé number be smallest edges that have removed from a graph such it remains connected but without any perfect matching. Thereafter, this parameter attracted much more attention researchers both mathematics theoretical chemistry. present paper, we report on results related graphs. Some new nanotubes, polyomino system cactus chains are also proven. We conclude paper with some open problems.
منابع مشابه
Anti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملNanotubes: Number of Kekulé Structures and Aromaticity
Carbon nanotubes (CNTs) are composed of cylindrical graphite sheets consisting of sp(2) carbons. Due to their structure CNTs are considered to be aromatic systems. In this work the number of Kekulé structures (K) in "armchair" CNTs was estimated by using the transfer matrix technique. All Kekulé structures of the cyclic variants of naphthalene and benzo[c]phenanthrene have been generated and th...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Chemistry
سال: 2021
ISSN: ['1572-8897', '0259-9791']
DOI: https://doi.org/10.1007/s10910-021-01221-x